A Search for Extended Objects with Variable Nuclei
نویسندگان
چکیده
منابع مشابه
Extended Objects with Edges
We examine, from a geometrical point of view, the dynamics of a relativistic extended object with loaded edges. In the case of a Dirac-Nambu-Goto [DNG] object with DNG edges, the worldsheet m generated by the parent object is, as in the case without boundary, an extremal timelike surface in spacetime. Using simple variational arguments, we demonstrate that the worldsheet of each edge is a const...
متن کاملA Search for “ Dwarf ” Seyfert Nuclei . IV . Nuclei with Broad H α Emission
We present the results of an optical spectroscopic survey designed to search for low-luminosity, “dwarf” Seyfert nuclei in a magnitude-limited (BT ≤ 12.5 mag) sample of 486 bright, northern galaxies. Moderate-resolution spectra of exceptionally high quality were obtained in part to detect broad Hα emission, similar in character to, but much weaker than, the broad permitted lines that define typ...
متن کاملA Search Algorithm for Latent Variable Models with Unbounded Domains
This paper concerns learning and prediction with probabilistic models where the domain sizes of latent variables have no a priori upper-bound. Current approaches represent prior distributions over latent variables by stochastic processes such as the Dirichlet process, and rely on Monte Carlo sampling to estimate the model from data. We propose an alternative approach that searches over the doma...
متن کاملA Variable Neighbourhood Search Algorithm with Compound Neighbourhoods for VRPTW
The Vehicle Routing Problem with Time Windows (VRPTW) consists of constructing least cost routes from a depot to a set of geographically scattered service points and back to the depot, satisfying service time interval and capacity constraints. A Variable Neighbourhood Search algorithm with Compound Neighbourhoods is proposed to solve VRPTW in this paper. A number of independent neighbourhood op...
متن کاملProof Search with Set Variable
We show how a procedure developed by Bledsoe for automatically nding substitution instances for set variables in higher-order logic can be adapted to provide increased automation in proof search in the Calculus of Constructions (CC). Bledsoe's procedure operates on an extension of rst-order logic that allows existential quantiication over set variables. The method nds maximal solutions for this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symposium - International Astronomical Union
سال: 1999
ISSN: 0074-1809
DOI: 10.1017/s007418090011352x